Welcome![Sign In][Sign Up]
Location:
Search - deadlock detection algorithm in

Search list

[Other死锁的模拟与检测

Description: 程序运行时,首先提示“请输入资源分配表文件的文件名:”;再提示“请输入进程等待表文件的文件名:”。 输入两个文件名后,程序将读入两个文件中的有关数据,并按照死锁检测算法进行检测。-running, first suggested "Please enter resource allocation table file name in the paper :"; another suggested "Please wait for the process to import files Table Name :." The two documents were imported, the program will read the two documents related data and in accordance with the deadlock detection algorithm for detection.
Platform: | Size: 2466 | Author: 王国强 | Hits:

[Mathimatics-Numerical algorithms死锁检测算法C++

Description: 操作系统的死锁检测算法, VC++调试通过-operating system Deadlock Detection Algorithm, debugging through VC
Platform: | Size: 1024 | Author: liu | Hits:

[Other死锁的模拟与检测

Description: 程序运行时,首先提示“请输入资源分配表文件的文件名:”;再提示“请输入进程等待表文件的文件名:”。 输入两个文件名后,程序将读入两个文件中的有关数据,并按照死锁检测算法进行检测。-running, first suggested "Please enter resource allocation table file name in the paper :"; another suggested "Please wait for the process to import files Table Name :." The two documents were imported, the program will read the two documents related data and in accordance with the deadlock detection algorithm for detection.
Platform: | Size: 2048 | Author: 王国强 | Hits:

[OS Develop2005

Description: ⑴模拟一个死锁检测算法; ⑵该算法能通过简化资源分配图来检测死锁; ⑶资源分配图可以用矩阵的形式表示; ⑷输出结果为有死锁或无死锁。 -⑴ simulation of a deadlock detection algorithm ⑵ The algorithm can simplify the resource allocation graph to detect deadlock ⑶ resource allocation plan can be expressed in the form of matrix ⑷ output for the deadlock or deadlock-free.
Platform: | Size: 73728 | Author: gaoliang | Hits:

[Special Effects1

Description: 自适应核密度估计运动检测方法 提出一种自适应的核密度(kernel density estimation, KDE)估计运动检测算法. 算法首先提出一种自适应前景、背景阈值的双阈值选择方法, 用于像素分类. 该方法用双阈值能克服用单阈值分类存在的不足, 阈值的选择能自适应进行, 且能适应不同的场景. 在此基础上, 本文提出了基于概率的背景更新模型, 按照像素的概率来更新背景, 并利用帧间差分背景模型和KDE分类结果, 来解决背景更新中的死锁问题, 同时检测背景的突然变化. 实验证明了所提出方法的适应性和可靠性.-Adaptive kernel density estimation method of motion detection of an adaptive kernel density (kernel density estimation, KDE) estimated motion detection algorithm. Algorithm first proposed an adaptive prospects, the background of the dual-threshold threshold selection method for pixel classification. The method used to overcome the dual-threshold single classification threshold shortcomings, the choice of threshold can be adaptive, and able to adapt to different scenes. On this basis, this paper, based on the probability of the background update model, in accordance with the probability of pixels to update the background, and take advantage of interframe differential background model and the classification results of KDE, to resolve the deadlock in the background update, while detection of abrupt changes in the background. Experiments show the proposed method of adaptability and reliability.
Platform: | Size: 1480704 | Author: maolei | Hits:

[Documents2007

Description: 目的与要求: 本设计的目的是通过对死锁检测算法的模拟,来了解死锁检测中的数据结构的设计和使用以及资源分配图在死锁检测中的应用。具体要求如下: ⑴模拟一个死锁检测算法; ⑵该算法能通过简化资源分配图来检测死锁; ⑶资源分配图可以用矩阵的形式表示; ⑷输出结果为有死锁或无死锁。 -Purpose and requirements: The purpose of this design is the deadlock detection algorithm through the simulation, to understand the deadlock detection data structure, as well as the design and use of the resource allocation map in the deadlock detection. Specific requirements are as follows: ⑴ simulated a deadlock detection algorithm ⑵ The algorithm can simplify the allocation of resources to detect the deadlock graph ⑶ resource allocation plan can be expressed in the form of matrix ⑷ output for the deadlock or deadlock-free.
Platform: | Size: 73728 | Author: bbsky | Hits:

[assembly languageallocation

Description: There are three methods for handling deadlocks in resource allocation systems deadlock prevention, deadlock avoidance and deadlock detection combined with recovery. Of these three methods deadlock avoidance is preferable in many cases but seldom used on account of its high cost. We present a simple modification of a known deadlock avoidance algorithm, the banker s algorithm, which has a running time O(mn 2) in a system consisting of n processes and m different types of resources. Our modified algorithm gives an amortized worst case running time of O(mn) under certain likely conditions and in that way it can be considered a competitive method for handling deadlocks. At worst, our algorithm is twice as fast as the banker s algorithm,
Platform: | Size: 951296 | Author: yangs | Hits:

[Windows Developbanker

Description: 该代码通过C语言编写完成,完整的实现了银行家算法,安全检测算法,避免了死锁.(The code written in C language completed a complete bankers algorithm, security detection algorithm, to avoid deadlock.)
Platform: | Size: 34816 | Author: SSHkang | Hits:

CodeBus www.codebus.net